Denotational cost semantics for functional languages with inductive types
نویسندگان
چکیده
منابع مشابه
Denotational Semantics for Teaching Lazy Functional Programming
If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Chitil, Olaf (1999) Denotational Semantics for Teaching Lazy Functional Programming. In: Proceedings of the Workshop on Functional and Declarative Programming in Education, 29 September 1999, Paris, F...
متن کاملDenotational Versus Declarative Semantics for Functional Programming
Denotational semantics is the usual mathematical semantics for functional programming languages. It is higher order (H.O.) in the sense that the semantic domain D includes D ! D] as a subdomain. On the other hand, the usual declarative semantics for logic programs is rst order (F.O.) and given by the least Herbrand model. In this paper, we take a restricted kind of H.O. conditional rewriting sy...
متن کاملBlended Algebraic and Denotational Semantics for Adt Languages with Mutable Objects Blended Algebraic and Denotational Semantics for Adt Languages with Mutable Objects
Syntax: P 2 Program TD 2 Type-Declaration T, S, U 2 Type-Name MD 2 Method-Declaration F* 2 Formal-List F 2 Formal B 2 Body D 2 Declaration E 2 Expression g 2 Method-Name E* 2 Expression-List C 2 Command M 2 Main I 2 Identi er N 2 Numeric-literal P ::= TD MD M TD ::= j type I fields ( F* ) j TD1 ; TD2 FD ::= j I : T j FD1 ; FD2 T ::= I MD ::= j method I ( F* ) : T f B g j MD1 ; MD2 F* ::= j F F*...
متن کاملDeclarative Semantics for Functional Languages
We present a semantics for an applied call-by-value lambda-calculus that is compositional, extensional, and elementary. We present four different views of the semantics: 1) as a relational (big-step) semantics that is not operational but instead declarative, 2) as a denotational semantics that does not use domain theory, 3) as a non-deterministic interpreter, and 4) as a variant of the intersec...
متن کاملAn Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
With the aim of putting type-based reasoning for functional logic languages, as recently explored by Christiansen et al. (2010), on a formal basis, we develop a denotational semantics for a typed core language of Curry. Dealing with the core language FlatCurry rather than with full Curry suffices, since there exists a type-preserving translation from the latter into the former. In contrast to e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2858949.2784749